Neighbour-transitive codes and partial spreads in generalised quadrangles

نویسندگان

چکیده

A code C in a generalised quadrangle $${\mathcal {Q}}$$ is defined to be subset of the vertex set point-line incidence graph $${\Gamma }$$ . The minimum distance $$\delta $$ smallest between pair distinct elements C. metric gives rise partition $$\{C,C_1,\ldots ,C_\rho \}$$ , where $$\rho maximum any and its nearest element Since diameter 4, both are at most 4. If =4$$ then partial ovoid or spread if, additionally, =2$$ an spread. neighbour-transitive if automorphism group acts transitively on each sets $$C_1$$ Our main results (i) classify all codes admitting insoluble automorphisms thick classical quadrangles that correspond ovoids spreads, (ii) give two infinite families six sporadic examples with $${\mathsf {W}}_3(q)$$ not spreads.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sporadic neighbour-transitive codes in Johnson graphs

We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least 3 which admit a neighbour-transitive group of automorphisms that is an almost simple 2-transitive group of degree v and does not occur in an infinite family of 2-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum dis...

متن کامل

Neighbour-transitive codes in Johnson graphs

The Johnson graph J(v, k) has, as vertices, the k-subsets of a v-set V and as edges the pairs of k-subsets with intersection of size k − 1. We introduce the notion of a neighbour-transitive code in J(v, k). This is a vertex subset Γ such that the subgroup G of graph automorphisms leaving Γ invariant is transitive on both the set Γ of ‘codewords’ and also the set of ‘neighbours’ of Γ, which are ...

متن کامل

Entry-faithful 2-neighbour transitive codes

We consider a code to be a subset of the vertex set of a Hamming graph. The set of s-neighbours of a code is the set of vertices, not in the code, at distance s from some codeword, but not distance less than s from any codeword. A 2-neighbour transitive code is a code which admits a group X of automorphisms which is transitive on the s-neighbours, for s = 1, 2, and transitive on the code itself...

متن کامل

Spreads and ovoids of finite generalized quadrangles

We survey recent results on spreads and ovoids of finite generalized quadrangles. Included in the survey are results on ovoids of PG(3, q); translation ovoids of Q(4, q); characterisations of generalized quadrangles using subquadrangles and ovoids of subquadrangles; and spreads of T2(Ω).

متن کامل

Generalized Quadrangles and Transitive Pseudo-Hyperovals

A pseudo-hyperoval of a projective space PG(3n− 1, q), q even, is a set of q +2 subspaces of dimension n − 1 such that any three span the whole space. We prove that a pseudo-hyperoval with an irreducible transitive stabiliser is elementary. We then deduce from this result a classification of the thick generalised quadrangles Q that admit a point-primitive, line-transitive automorphism group wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2022

ISSN: ['0925-1022', '1573-7586']

DOI: https://doi.org/10.1007/s10623-022-01053-z